Geometric programming problem with single-term exponents subject to max-product fuzzy relational equations
نویسندگان
چکیده
منابع مشابه
Posynomial geometric programming problem subject to max–product fuzzy relation equations
In this article, we study a class of posynomial geometric programming problem (PGPF), with the purpose of minimizing a posynomial subject to fuzzy relational equations with max–product composition. With the help of auxiliary variables, it is converted convert the PGPF into an equivalent programming problem whose objective function is a non-decreasing function with an auxiliary variable. Some pr...
متن کاملMultiobjective Programming Problem with Fuzzy Relational Equations
⎯In this paper we propose a methodology for the solution of multiobjective programming problem with fuzzy relational equations (FRE’s) as constraints. In the first part of the proposed methodology, we find the feasible solution set of FRE’s and give an algorithm to compute minimal solutions and maximal solutions of objective functions which can also be computed by constructed computer program a...
متن کاملGeometric Programming Problem with Trapezoidal Fuzzy Variables
Nowadays Geometric Programming (GP) problem is a very popular problem in many fields. Each type of Fuzzy Geometric Programming (FGP) problem has its own solution. Sometimes we need to use the ranking function to change some part of GP to the linear one. In this paper, first, we propose a method to solve multi-objective geometric programming problem with trapezoidal fuzzy variables; then we use ...
متن کاملSome Results of the Bipolar Max-product Fuzzy Relational Equations
In the literature, some studies have shown that determining the consistency of bipolar fuzzy relational equations is NP-complete. Namely, the solution procedure for solving a system of bipolar fuzzy relational equations with max-product composition contains a high computational complexity. In this study, some sufficient conditions for consistency of bipolar fuzzy relational equations are propos...
متن کاملNonlinear Optimization Subject to a System of Fuzzy Relational Equations with Max-min Composition∗
In this paper we show that the problem of minimizing a nonlinear objective function subject to a system of fuzzy relational equations with max-min composition can be reduced to a 0-1 mixed integer programming problem. The reduction method can be extended to the case of fuzzy relational equations with max-T composition as well as those with more general composition.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2011
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2010.07.018